Integer factorization algorithms

Results: 208



#Item
161Modular arithmetic / Public-key cryptography / Finite fields / Integer factorization algorithms / RSA / Euclidean algorithm / Prime number / Discrete logarithm / Chinese remainder theorem / Abstract algebra / Mathematics / Cryptography

Cryptography and Computer Security CS255

Add to Reading List

Source URL: crypto.stanford.edu

Language: English - Date: 2011-01-03 19:52:41
162Integer factorization algorithms / Algebraic number theory / Prime number / Polynomial / Greatest common divisor / Integer / Algebraic integer / Euclidean algorithm / Mathematics / Abstract algebra / Number theory

SMT[removed]Advanced Topics Test February 18, 2012

Add to Reading List

Source URL: sumo.stanford.edu

Language: English - Date: 2014-05-28 23:53:37
163Finite fields / Modular arithmetic / Lenstra elliptic curve factorization / Lucas–Lehmer primality test / Integer factorization algorithms / Mathematics / Number theory

Errata and clarifications for Prime numbers: a computational perspective, 2nd edition Updated February 18, 2009 R. Crandall and C. Pomerance

Add to Reading List

Source URL: www.math.dartmouth.edu

Language: English - Date: 2009-02-18 09:38:34
164TWINKLE / Quadratic sieve / General number field sieve / Arjen Lenstra / Rational sieve / Integer factorization / Key size / Factor base / RSA Factoring Challenge / Cryptography / Integer factorization algorithms / TWIRL

On the Cost of Factoring RSA-1024 Adi Shamir

Add to Reading List

Source URL: tau.ac.il

Language: English - Date: 2005-02-10 22:54:25
165Quadratic sieve / General number field sieve / Quadratic residue / Special number field sieve / Lenstra elliptic curve factorization / Euclidean algorithm / Prime number / Sieve of Eratosthenes / Smooth number / Integer factorization algorithms / Mathematics / Number theory

SMOOTH NUMBERS AND THE QUADRATIC SIEVE Carl Pomerance When faced with a large number n to factor, what do you do first? You might say “Look

Add to Reading List

Source URL: www.math.leidenuniv.nl

Language: English - Date: 2004-11-24 09:42:47
166General number field sieve / RSA Factoring Challenge / RSA / Arjen Lenstra / Prime number / Factorization / Integer factorization records / Lattice sieving / Polynomial / Integer factorization algorithms / Cryptography / Mathematics

Factorization of a 512–Bit RSA Modulus Stefania Cavallar3, Bruce Dodson8 , Arjen K. Lenstra1 , Walter Lioen3 , Peter L. Montgomery10 , Brian Murphy2 , Herman te Riele3 , Karen Aardal13 ,

Add to Reading List

Source URL: www.iai.uni-bonn.de

Language: English - Date: 2002-07-30 11:33:08
167Theoretical computer science / Finite fields / Integer sequences / Integer factorization algorithms / AKS primality test / Lucas–Lehmer primality test / Prime number / Time complexity / Fast Fourier transform / Mathematics / Primality tests / Abstract algebra

On the implementation of AKS-class primality tests R. Crandall* and J. Papadopoulos**

Add to Reading List

Source URL: www.dm.unito.it

Language: English - Date: 2005-11-17 04:47:46
168Finite fields / RSA / Integer factorization algorithms / Blind signature / Digital signature / XTR / RSA Factoring Challenge / RSA numbers / Cryptography / Public-key cryptography / Electronic commerce

The One-More-RSA-Inversion Problems and the Security of Chaum’s Blind Signature Scheme∗ M. Bellare†

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2002-06-17 02:02:47
169Integer factorization algorithms / Field theory / Finite fields / Primality tests / Analytic number theory / Elliptic curve / Lenstra elliptic curve factorization / Prime number / Integer factorization / Abstract algebra / Mathematics / Algebra

Proceedings of the International Congress of Mathematicians Berkeley, California, USA, 1986

Add to Reading List

Source URL: www.mathunion.org

Language: English - Date: 2012-04-18 10:44:43
170Integer factorization algorithms / Primality tests / Analytic number theory / Finite fields / Integer sequences / Quadratic sieve / Prime number / Lenstra elliptic curve factorization / Riemann hypothesis / Mathematics / Number theory / Abstract algebra

are so laborious and difficult that even for numbers that do not exceed the limits of tables constructed by estimable men, they try the patience of even the practiced calculator. And these methods do not apply at

Add to Reading List

Source URL: www.math.dartmouth.edu

Language: English - Date: 2006-08-14 10:52:24
UPDATE